1. Identity statement | |
Reference Type | Conference Paper (Conference Proceedings) |
Site | sibgrapi.sid.inpe.br |
Holder Code | ibi 8JMKD3MGPEW34M/46T9EHH |
Identifier | 6qtX3pFwXQZeBBx/DFNNa |
Repository | sid.inpe.br/banon/2004/10.06.16.04 |
Last Update | 2004:10.06.03.00.00 (UTC) administrator |
Metadata Repository | sid.inpe.br/banon/2004/10.06.16.04.24 |
Metadata Last Update | 2022:06.14.00.12.51 (UTC) administrator |
DOI | 10.1109/SIBGRA.2004.1352969 |
Citation Key | ParariEspeOlivCava:2004:FaPoVa |
Title | Fast Polygonization of Variational Implicit Surfaces |
Format | On-line |
Year | 2004 |
Access Date | 2024, Apr. 29 |
Number of Files | 1 |
Size | 408 KiB |
|
2. Context | |
Author | 1 Parari, Alvaro Cuno 2 Esperança, Claudio 3 Oliveira, Antonio Alberto Fernandes de 4 Cavalcanti, Paulo Roma |
Affiliation | 1 COPPE/UFRJ |
Editor | Araújo, Arnaldo de Albuquerque Comba, João Luiz Dihl Navazo, Isabel Sousa, Antônio Augusto de |
e-Mail Address | esperanc@lcg.ufrj.br |
Conference Name | Brazilian Symposium on Computer Graphics and Image Processing, 17 (SIBGRAPI) - Ibero-American Symposium on Computer Graphics, 2 (SIACG) |
Conference Location | Curitiba, PR, Brazil |
Date | 17-20 Oct. 2004 |
Publisher | IEEE Computer Society |
Book Title | Proceedings |
Tertiary Type | Full Paper |
History (UTC) | 2008-07-17 14:10:58 :: esperanc -> banon :: 2008-08-26 15:15:44 :: banon -> administrator :: 2009-08-13 20:37:40 :: administrator -> banon :: 2010-08-28 20:01:16 :: banon -> administrator :: 2022-06-14 00:12:51 :: administrator -> :: 2004 |
|
3. Content and structure | |
Is the master or a copy? | is the master |
Content Stage | completed |
Transferable | 1 |
Version Type | finaldraft |
Keywords | polygonization implicit surfaces RBF |
Abstract | This article presents a simple hierarchical adaptation of the Marching Cubes algorithm for polygonizing variational implicit surfaces used in modelling and reconstruction applications. The technique relies on placing the normal and boundary constraint points respecting a pseudo-Euclidean distance metrics. This procedure makes it possible to quickly prune the space and minimize the number of costly function evaluations and thus converge rapidly to the surface. Timings show that this technique tends to perform faster than Bloomenthal's continuation polygonizer. |
Arrangement 1 | urlib.net > SDLA > Fonds > SIBGRAPI 2004 > Fast Polygonization of... |
Arrangement 2 | urlib.net > SDLA > Fonds > Full Index > Fast Polygonization of... |
doc Directory Content | access |
source Directory Content | there are no files |
agreement Directory Content | there are no files |
|
4. Conditions of access and use | |
data URL | http://urlib.net/ibi/6qtX3pFwXQZeBBx/DFNNa |
zipped data URL | http://urlib.net/zip/6qtX3pFwXQZeBBx/DFNNa |
Language | en |
Target File | vispoly_paper.pdf |
User Group | esperanc administrator |
Visibility | shown |
|
5. Allied materials | |
Next Higher Units | 8JMKD3MGPEW34M/46QM2BE 8JMKD3MGPEW34M/4742MCS |
Citing Item List | sid.inpe.br/sibgrapi/2022/05.03.00.29 7 |
Host Collection | sid.inpe.br/banon/2001/03.30.15.38 |
|
6. Notes | |
Empty Fields | archivingpolicy archivist area callnumber contenttype copyholder copyright creatorhistory descriptionlevel dissemination documentstage edition electronicmailaddress group isbn issn label lineage mark mirrorrepository nextedition notes numberofvolumes orcid organization pages parameterlist parentrepositories previousedition previouslowerunit progress project publisheraddress readergroup readpermission resumeid rightsholder schedulinginformation secondarydate secondarykey secondarymark secondarytype serieseditor session shorttitle sponsor subject tertiarymark type url volume |
|